An eective implementation of the Lin±Kernighan traveling salesman heuristic
نویسنده
چکیده
This paper describes an implementation of the Lin±Kernighan heuristic, one of the most successful methods for generating optimal or near-optimal solutions for the symmetric traveling salesman problem (TSP). Computational tests show that the implementation is highly eective. It has found optimal solutions for all solved problem instances we have been able to obtain, including a 13,509-city problem (the largest non-trivial problem instance solved to optimality today). Ó 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
An Eflective Heuristic Algorithm for the Traveling. THE SYMMETRIC traveling-salesman problem is: Given an n by n symmetric matrix of.symmetric traveling salesman problem. However, the design and implementation of an algorithm based on this heuristic is not trivial. There are many.This article is about the heuristic for the travelling salesman problem. An Effective Heuristic Algorithm for the Tr...
متن کاملAn effective implementation of the Lin-Kernighan traveling salesman heuristic
This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or nearoptimal solutions for the symmetric traveling salesman problem. Computational tests show that the implementation is highly effective. It has found optimal solutions for all solved problem instances we have been able to obtain, including a 7397-city problem (th...
متن کاملSolving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملGeneral k-opt submoves for the Lin-Kernighan TSP heuristic
Local search with k-exchange neighborhoods, k-opt, is the most widely used heuristic method for the traveling salesman problem (TSP). This paper presents an effective implementation of k-opt in LKH-2, a variant of the Lin–Kernighan TSP heuristic. The effectiveness of the implementation is demonstrated with experiments on Euclidean instances ranging from 10,000 to 10,000,000 cities. The runtime ...
متن کاملAn Effective Implementation of K-opt Moves for the Lin-Kernighan TSP Heuristic
Local search with k-change neighborhoods, k-opt, is the most widely used heuristic method for the traveling salesman problem (TSP). This report presents an effective implementation of k-opt for the LinKernighan TSP heuristic. The effectiveness of the implementation is demonstrated with extensive experiments on instances ranging from 10,000 to 10,000,000 cities.
متن کامل